On covering and coloring problems for rook domains
نویسندگان
چکیده
منابع مشابه
global results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Asymptotics of Hypergraph Matching, Covering and Coloring Problems
A hypergraph H is simply a collection of subsets of a finite set, which we will always denote by V. Elements of V are called vertices and elements of H edges. A hypergraph is k-uniform (k-bounded) if each of its edges has size k (at most k). The degree in H of a vertex x is the number of edges containing x, and is denoted by d(x). Similarly, d(x,y) denotes the number of edges containing both of...
متن کاملAlgorithmic Bounds on Hypergraph Coloring and Covering
Consider the coloring of a vertex-labelled r-uniform hypergraph G(V,E), where V is the vertex set of n labelled vertices, and E is the set of hyperedges. In case of proper bicoloring, given two colors, we need to assign each vertex with one of the colors so that none of the hyperedges is monochromatic. This may not always be possible. In such cases, we use multiple bicolorings to ensure that ea...
متن کاملCut Coloring and Circuit Covering
We prove that for every 3-edge-connected graph G there exists a partition of E(G) into at most nine sets {X1, X2, . . . , Xm} so that G \ Xi is 2-edge-connected for every 1 ≤ i ≤ m. We then generalize this result, proving that for every (2k+1)-edgeconnected graph G there is a partition of E(G) into a bounded number (depending only on k) of sets {X1, X2, . . . , Xm} so that G \ Xi is 2k-edge-con...
متن کاملCovering and coloring polygon-circle graphs
Polygon-circle graphs are intersection graphs of polygons inscribed in a circle. This class of graphs includes circle graphs (intersection graphs of chords of a circle), circular arc graphs (intersection graphs of arcs on a circle), chordal graphs and outerplanar graphs. We investigate binding functions for chromatic number and clique covering number of polygon-circle graphs in terms of their c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1985
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90152-9